Decidable and Undecidable Arithmetic Functions in Actin Filament Networks
نویسنده
چکیده
The plasmodium of Physarum polycephalum, called slime mould, is very sensitive to its environment and reacts to stimuli by its appropriate motions. The sensitive stage as well as the motor stage of these reactions are explained by actin filament networks. This paper is devoted to actin filament networks as a computation medium. The point is that actin filaments are sensitive to outer cellular stimuli (attractants as well as repellents) and they appear and disappear at different places of the cell to change the cell structure, e.g. its shape. Due to assembling and disassembling actin filaments, Physarum polycephalum as well as other unicellular organisms like Amoeba proteus can move in responses to different stimuli. As a result, these organisms can be considered a simple reversible logic gate, where outer cellular signals are its inputs and the motions are its outputs. In this way, we can implement different logic gate on the amoeboid behaviours. The actin filament networks have the same basic properties as neural networks: lateral inhibition; lateral activation; recurrent inhibition; recurrent excitation; feedforward inhibition; feedforward excitation; convergence/divergence. These networks can embody arithmetic functions defined recursively and corecursively within p-adic valued logic. Furthermore, within these networks we can define the so-called diagonalization for deducing undecidable arithmetic functions.
منابع مشابه
A Quantum Gate as a Physical Model of an Universal Arithmetical Algorithm without Church’s Undecidability and Gödel’s Incompleteness
In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula (operation) can be decided (realized, calculated. Arithmetic defined by universal qm-arithmetical algorithm called qmarithmetic one-to-one corresponds to decidable ...
متن کاملThe Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable
The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the known boundary between decidable and undecidable in that we show that the purely universal fragment of the extended theory is already undecidable. Our proof is ...
متن کاملWhat's Decidable about Syntax-Guided Synthesis?
Syntax-guided synthesis (SyGuS) is a recently proposed framework for program synthesis problems. The SyGuS problem is to find an expression or program generated by a given grammar that meets a correctness specification. Correctness specifications are given as formulas in suitable logical theories, typically amongst those studied in satisfiability modulo theories (SMT). In this work, we analyze ...
متن کاملBuilding Distinct Actin Filament Networks in a Common Cytoplasm
Eukaryotic cells generate a diversity of actin filament networks in a common cytoplasm to optimally perform functions such as cell motility, cell adhesion, endocytosis and cytokinesis. Each of these networks maintains precise mechanical and dynamic properties by autonomously controlling the composition of its interacting proteins and spatial organization of its actin filaments. In this review, ...
متن کاملThe Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable
First-order linear real arithmetic enriched with uninterpreted predicate symbols yields an interesting modeling language. However, satisfiability of such formulas is undecidable, even if we restrict the uninterpreted predicate symbols to arity one. In order to find decidable fragments of this language, it is necessary to restrict the expressiveness of the arithmetic part. One possible path is t...
متن کامل